A note on Pollard’s Theorem
نویسندگان
چکیده
Let A,B be nonempty subsets of a an abelian group G. Let Ni(A,B) denote the set of elements of G having i distinct decompositions as a product of an element of A and an element of B. We prove that ∑ 1≤i≤t |Ni(A,B)| ≥ t(|A|+ |B| − t− α+ 1 + w) − w, where α is the largest size of a coset contained in AB and w = min(α − 1, 1), with a strict inequality if α ≥ 3 and t ≥ 2, or if α ≥ 2 and t = 2. This result is a local extension of results by Pollard and Green–Ruzsa and extends also for t > 2 a recent result of Grynkiewicz, conjectured by Dicks–Ivanov (for non necessarily abelian groups) in connection to the famous Hanna Neumann problem in Group Theory. MSC Classification: 11B60, 11B34, 20D60.
منابع مشابه
A note on spectral mapping theorem
This paper aims to present the well-known spectral mapping theorem for multi-variable functions.
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملA Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کاملElliptic Curves and Lenstra’s Factorization Algorithm
This paper provides a foundation for understanding Lenstra’s Elliptic Curve Algorithm for factoring large numbers. We give a definition of elliptic curves over fields of characteristic not 2 or 3, followed by a construction of the abelian group over the K-rational points of an elliptic curve. Next, Pollard’s p− 1 algorithm is explained, as well as the Hasse-Weil Bound, after which follows a dis...
متن کاملOn random walks of Pollard’s rho method for the ECDLP on Koblitz curves
Pollard’s rho method is the asymptotically fastest known attack for the elliptic curve discrete logarithm problem (ECDLP) except special cases. It works by giving a pseudo-random sequence defined by an iteration function and then detecting a collision in the sequence. We note that the number of iterations before obtaining a collision is significant for the running time of the rho method and dep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008